A tabu search/path relinking algorithm to solve the job shop scheduling problem
نویسندگان
چکیده
منابع مشابه
A tabu search/path relinking algorithm to solve the job shop scheduling problem
We present an algorithm that incorporates a tabu search procedure into the framework of path relinking to tackle the job shop scheduling problem (JSP). This tabu search/path relinking (TS/PR) algorithm comprises several distinguishing features, such as a specific relinking procedure and a reference solution determination method. To test the performance of TS/PR, we apply it to tackle almost all...
متن کاملAn Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations
Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...
متن کاملParallel tabu search for the cyclic job shop scheduling problem
In this paper, we consider a cyclic job shop problem, consisting of production of a certain set of elements at fixed intervals. Optimization of the process is reduced to a minimization of a cycle time, i.e. the time, after which the next batch of the same elements may be produced. We introduce a new parallel method for the cost function calculation. The parallelization is not trivial and cannot...
متن کاملNew Tabu Search Results for the Job Shop Scheduling Problem
In the classical job shop scheduling problem (JSSP), n jobs are processed to completion on m unrelated machines. Each job requires processing on each machine exactly once. For each job, technology constraints specify a complete, distinct routing which is fixed and known in advance. Processing times are sequence-independent, fixed, and known in advance. Each machine is continuously available fro...
متن کاملSome New Results on Tabu Search Algorithm Applied to the Job-Shop Scheduling Problem
The Job-Shop Scheduling Problem (JSSP) with the makespan criterion comes from the manufacturing industry and has excellent practical applications. The problem can be briefly described as follows. There are a set of jobs and a set of machines. Each job consists of a sequence of operations, and each of the operations uses one of the machines for a fixed duration. Each machine processes at most on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2015
ISSN: 0305-0548
DOI: 10.1016/j.cor.2014.08.006